An Explicit Integral Polynomial Whose Splitting Field Has
نویسندگان
چکیده
Using the principle that characteristic polynomials of matrices obtained from elements of a reductive group G over Q typically have splitting field with Galois group isomorphic to the Weyl group of G, we construct an explicit monic integral polynomial of degree 240 whose splitting field has Galois group the Weyl group of the exceptional group of type E8.
منابع مشابه
Consensus Halving is PPA-Complete
We show that the computational problem CONSENSUS-HALVING is PPA-complete, the first PPA-completeness result for a problem whose definition does not involve an explicit circuit. We also show that an approximate version of this problem is polynomial-time equivalent to NECKLACE SPLITTING, which establishes PPAD-hardness for NECKLACE SPLITTING, and suggests that it is also PPA-complete.
متن کاملMEANDERING OF TRAJECTORIES OF POLYNOMIAL VECTOR FIELDS IN THE AFFINE n-SPACE
We give an explicit upper bound for the number of isolated intersections between an integral curve of a polynomial vector field in Rn and an affine hyperplane. The problem turns out to be closely related to finding an explicit upper bound for the length of ascending chains of polynomial ideals spanned by consecutive derivatives. This exposition constitutes an extended abstract of a forthcoming ...
متن کاملAn Explicit Treatment of Cubic Function Fields with Applications
We give an explicit treatment of cubic function fields of characteristic at least five. This includes an efficient technique for converting such a field into standard form, formulae for the field discriminant and the genus, simple necessary and sufficient criteria for non-singularity of the defining curve, and a characterization of all triangular integral bases. Our main result is a description...
متن کاملExplicit factorization of $x^n-1\in \mathbb F_q[x]$
Let $\mathbb F_q$ be a finite field and $n$ a positive integer. In this article, we prove that, under some conditions on $q$ and $n$, the polynomial $x^n-1$ can be split into irreducible binomials $x^t-a$ and an explicit factorization into irreducible factors is given. Finally, weakening one of our hypothesis, we also obtain factors of the form $x^{2t}-ax^t+b$ and explicit splitting of $x^n-1$ ...
متن کاملIntegral Minimisation Improvement for Murphy’s Polynomial Selection Algorithm
We consider Murphy’s polynomial selection algorithm for the general number field sieve. One of the steps in this algorithm consists of finding a minimum of an integral. However, the size of the polynomial coefficients causes the classical steepest descent algorithm to be ineffective. This article brings an idea how to improve the steepest descent algorithm so that it converges better and faster...
متن کامل